منابع مشابه
Dynamic Grammars with Lookahead Composition for WFST-based Speech Recognition
Automatic Speech Recognition (ASR) applications often employ a mixture of static and dynamic grammar components, and can thus benefit from the ability to efficiently modify the system vocabulary and other parameters in an on-line mode. This paper presents a novel, generic approach to dynamic grammar handling in the context of the Weighted Finite-State Transducer (WFST) paradigm. The method reli...
متن کاملHigher rank numerical ranges of rectangular matrix polynomials
In this paper, the notion of rank-k numerical range of rectangular complex matrix polynomials are introduced. Some algebraic and geometrical properties are investigated. Moreover, for ϵ > 0; the notion of Birkhoff-James approximate orthogonality sets for ϵ-higher rank numerical ranges of rectangular matrix polynomials is also introduced and studied. The proposed denitions yield a natural genera...
متن کاملOrthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
In this paper, we propose an efficient and scalable low rank matrix completion algorithm. The key idea is to extend orthogonal matching pursuit method from the vector case to the matrix case. We further propose an economic version of our algorithm by introducing a novel weight updating rule to reduce the time and storage complexity. Both versions are computationally inexpensive for each matrix ...
متن کاملHigh Rank Matrix Completion with Side Information
We address the problem of high-rank matrix completion with side information. In contrast to existing work dealing with side information, which assume that the data matrix is low-rank, we consider the more general scenario where the columns of the data matrix are drawn from a union of lowdimensional subspaces, which can lead to a high rank matrix. Our goal is to complete the matrix while taking ...
متن کاملLow-Rank Matrix Approximation with Stability
Low-rank matrix approximation has been widely adopted in machine learning applications with sparse data, such as recommender systems. However, the sparsity of the data, incomplete and noisy, introduces challenges to the algorithm stability – small changes in the training data may significantly change the models. As a result, existing low-rank matrix approximation solutions yield low generalizat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2014
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-014-9531-2